Constructible universe

Results: 1309



#Item
61Graded dominance Libor Bˇehounek1 , Ulrich Bodenhofer2 , Petr Cintula1 , and Susanne Saminger-Platz3 1 Institute of Computer Science Academy of Sciences of the Czech Republic, Prague, Czech Republic {behounek|cintula}@c

Graded dominance Libor Bˇehounek1 , Ulrich Bodenhofer2 , Petr Cintula1 , and Susanne Saminger-Platz3 1 Institute of Computer Science Academy of Sciences of the Czech Republic, Prague, Czech Republic {behounek|cintula}@c

Add to Reading List

Source URL: www.bioinf.jku.at

Language: English - Date: 2008-05-06 06:51:53
62Specification and Complexity of Collaborative Text Editing Hagit Attiya Sebastian Burckhardt Alexey Gotsman

Specification and Complexity of Collaborative Text Editing Hagit Attiya Sebastian Burckhardt Alexey Gotsman

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2016-05-22 15:37:07
63Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers∗ Hiroshi Fujiwara† Topic classification: Algorithms and data structures

Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers∗ Hiroshi Fujiwara† Topic classification: Algorithms and data structures

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:02:45
64LNCSOn the <TEX>{�hape l}</TEX>-Ary GCD-Algorithm in Rings of Integers

LNCSOn the <TEX>{hape l}</TEX>-Ary GCD-Algorithm in Rings of Integers

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2012-05-30 08:47:23
65ESAIM: PROCEEDINGS, October 2007, Vol.20, 53-62 Mohammed-Najib Benbourhim, Patrick Chenin, Abdelhak Hassouni & Jean-Baptiste Hiriart-Urruty, Editors EXISTENCE OF NONTRIVIAL SOLUTIONS FOR QUASI-LINEAR RESONANT PROBLEMS

ESAIM: PROCEEDINGS, October 2007, Vol.20, 53-62 Mohammed-Najib Benbourhim, Patrick Chenin, Abdelhak Hassouni & Jean-Baptiste Hiriart-Urruty, Editors EXISTENCE OF NONTRIVIAL SOLUTIONS FOR QUASI-LINEAR RESONANT PROBLEMS

Add to Reading List

Source URL: www.esaim-proc.org

Language: English
66Motivation The technique of forcing Cohen forcing Lebesgue measure Forcing: How to prove unprovability I

Motivation The technique of forcing Cohen forcing Lebesgue measure Forcing: How to prove unprovability I

Add to Reading List

Source URL: www.math.uni-bonn.de

Language: English - Date: 2015-11-11 09:54:27
67Towards a Unified Treatment of Induction (Abstract) Paul Taylor 26 August 1996 induction over the nat-erty of the natural numbers: Mathematical ural numbers has been familiar since Eus

Towards a Unified Treatment of Induction (Abstract) Paul Taylor 26 August 1996 induction over the nat-erty of the natural numbers: Mathematical ural numbers has been familiar since Eus

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:52:24
68LOWER BOUNDS FOR RESONANCES OF INFINITE AREA RIEMANN SURFACES ´ ERIC ´ DMITRY JAKOBSON AND FRED NAUD

LOWER BOUNDS FOR RESONANCES OF INFINITE AREA RIEMANN SURFACES ´ ERIC ´ DMITRY JAKOBSON AND FRED NAUD

Add to Reading List

Source URL: fredericnaud.perso.sfr.fr

Language: English - Date: 2010-02-11 06:12:49
69CS364B: Exercise Set #5 Optional (no due date) Lecture 9 Exercises Exercise 28 (Optional – Do Not Hand In) Let x be a maximal-in-distributional-range (MIDR) allocation rule. Recall that coupling x with the payment

CS364B: Exercise Set #5 Optional (no due date) Lecture 9 Exercises Exercise 28 (Optional – Do Not Hand In) Let x be a maximal-in-distributional-range (MIDR) allocation rule. Recall that coupling x with the payment

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-02-06 14:03:54
70Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55